Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition
نویسندگان
چکیده
منابع مشابه
Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition
The quantum Turing machine (QTM) has been introduced by Deutsch as an abstract model of quantum computation. The transition function of a QTM is linear, and has to be unitary to be a well-formed QTM. This well-formedness condition ensures that the evolution of the machine does not violate the postulates of quantum mechanics. However, we claim in this paper that the well-formedness condition is ...
متن کاملSome relations between quantum Turing machines and Turing machines
For quantum Turing machines we present three elements: Its components, its time evolution operator and its local transition function. The components are related with the components of deterministic Turing machines, the time evolution operator is related with the evolution of reversible Turing machines and the local transition function is related with the transition function of probabilistic and...
متن کاملModels of Quantum Turing Machines
Quantum Turing machines are discussed and reviewed in this paper. Most of the paper is concerned with processes defined by a step operator T that is used to construct a Hamiltonian H according to Feynman’s prescription. Differences between these models and the models of Deutsch are discussed and reviewed. It is emphasized that the models with H constructed from T include fully quantum mechanica...
متن کاملSimulations of Quantum Turing Machines by Quantum Multi-Stack Machines
As was well known, in classical computation, Turing machines, circuits, multi-stack machines, and multi-counter machines are equivalent, that is, they can simulate each other in polynomial time. In quantum computation, Yao [11] first proved that for any quantum Turing machines M , there exists quantum Boolean circuit (n, t)-simulating M , where n denotes the length of input strings, and t is th...
متن کاملSimulations of Quantum Turing Machines by Quantum Multi-Counter Machines
We define quantum multi-stack machines (abbr. QMSMs) by generalizing quantum pushdown automata (abbr. QPDAs) dealt with before from one-stack to multi-stack, and the well-formedness (abbr. W-F) conditions for characterizing the unitary evolution are presented. Afterwards, by means of QMSMs we define quantum multi-counter machines (abbr. QMCMs) that are somewhat different from the quantum counte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2011
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2011.01.009